Aiming at the problem of rapidly growing and frequently changing requirement for risk map generation of immovable cultural heritage， and existing programs and tools cannot meet the needs of actual applications， a method for constructing semantic model was proposed. Based on the semantic model， a Domain-Specific Language （DSL） close to natural language was designed for experts in the field of immovable cultural heritage. Firstly， a business model was extracted by conducting in-depth research on various indicators of immovable cultural heritage， as well as methods and processes for generating risk maps. Secondly， the meta-calculation units of the risk value calculation rules were abstracted， and a semantic model was constructed by analyzing the business model. On this basis， a DSL that can express all semantics in the semantic model was designed. The language script can be programmed by the field experts themselves and used to quickly and efficiently generate risk maps. It is easy to expand and can meet the needs of frequently changing requirements. Compared with the mainstream method of generating risk maps by using Geographic Information System （GIS）， the use of DSL to generate risk maps can reduce work hours by more than 66.7%.

Symmetric cryptography is the core technology of data confidentiality in information systems. At the same time， nonlinear S-box is usually the key cryptographic component， and is widely used in the design of block cipher， stream cipher， MAC （Message Authentication Code） algorithm， etc. In order to ensure the security of the cryptographic algorithm design， firstly， the criteria testing methods for differential uniformity， nonlinearity， fixed point number， algebraic degree and item number， algebraic immunity， avalanche characteristic and diffusion characteristic were researched. Secondly， the results of each security criterion of the S-box were designed and output in the visual window， and the detailed descriptions of the corresponding security criterion were given in a pop-up window way. Thirdly， the design of the sub-components of nonlinearity and algebraic immunity was focused， and the linear distribution table was simplified according to the nonlinearity. At the same time， based on the theorem， the calculation process of algebraic immunity was optimized and illustrated with an example. Finally， the S-box testing tool was implemented with seven security criteria， and the test cases were demonstrated. The proposed tool is mainly used to test the security criteria of the nonlinear component S-box in the symmetric cryptographic algorithm， and then provides a guarantee for the security of the overall algorithm.

Aiming at the problem of influence of the channel on the characteristics of the vowel formant， a systematic experiment was carried out. Firstly， the standard recordings of 8 volunteers were collected. Then， the standard recordings were played with the mouth simulator， and 104 channel recordings were recorded using 13 different channels. Finally， the characteristic voice segments were extracted， and chi-square test analysis was used in the qualitative analysis of the spectral characteristics， and one-sample t-test was used in the quantitative analysis of acoustic parameters. The statistical results show that about 69% of the channels have a significant influence on the overall form of the high-order formants， and about 85% of the channels have significant differences in the relative intensity of the formants. The one-sample t-test results show that there is no significant difference between the standard recordings and the channel recordings in center frequency of the formant. Experimental results show that the frequency characteristics of formants should be paid more attention to when processing the identification of voices in different channels.

Noise is required in differential privacy protection for spatial data with tree index. Most of the existing differential privacy budget methods adopt uniform allocation, and ordinary users can not personalize their choice. To solve this problem, an arithmetic sequence privacy budget allocation method and a geometric sequence privacy budget allocation method were proposed. Firstly, the spatial data was indexed by tree structure. Secondly, users could personalize the difference or ratio of privacy budgets assigned by two adjacent layers to dynamically adjust the privacy budget according to the needs of privacy protection and query accuracy. Finally, the privacy budget was allocated to each layer of tree to realize personalized and on-demand allocation. Theoretical analysis and experimental results show that these two methods are more flexible in the allocation of privacy budget than the uniform allocation method, and the geometric sequence allocation method is better than the arithmetic sequence allocation method.

Reasonable virtual machine allocating and efficient task scheduling is a key problem in the cloud computing. In order to better use virtual machine and make the system meet the service requests efficiently, a task scheduling algorithm based on Multi-scale Quantum Harmonic Oscillator Algorithm (MQHOA) was proposed. Firstly, each scheduling scheme was regarded as a sampling position, and then the randomness of Gaussian sampling was used to search the local optimal solution at the current scale. Then, whether the energy level was stable was judged. If the energy level was stable, it would enter the descent process and the worst scheduling scheme would be replaced. Finally, when the algorithm entered the process of scale reduction, the algorithm transitioned from global search to local search, eventually terminated and delivered the optimal result after several iterations. The simulation experiment results on CloudSim platform show that the makespan of task scheduling of MQHOA decreased by more than 10% and the degree of imbalance fell more than 0.4 in comparison with First Come First Serviced (FCFS) algorithm and Particle Swarm Optimization (PSO) algorithm. The experimental results show that the proposed algorithm has fast convergence rate and good characteristics of global convergence and adaptability. The task scheduling algorithm based on MQHOA can reduce the makespan of task scheduling and maintain the load balance of virtual machines in cloud computing.

Since the small combined stock market has less noise information, a random matrix denoising method amended by Monte Carlo simulation was proposed. Firstly, random matrix was generated by simulation; secondly, the lower and upper bounds of the noise were corrected simultaneously by using a large number of simulated data; finally, the range of noise was determined precisely. The Dow Jones China 88 Index and the Hang Seng 50 Index were used for empirical analysis. The simulation results show that, compared with LCPB (Laloux-Cizeau-Potters-Bouchaud), PG+(Plerou-Gopikrishnan) and KR (RMT denoising method based on correlation matrix eigenvector's Krzanowski stability), rationality and validity of the noise range corrected by Monte Carlo simulation denoising method are greatly improved in eigenvalue, eigenvector and inverse participation ratio. Investment portfolio of the correlation matrix before and after denoising was given, and the results indicate that the Monte Carlo simulation denoising method has the smallest value at risk under the same expected rate of return, which can provide a certain reference for the portfolio selection, risk management and other financial applications.

Due to the impact of temperature, voltage and device aging, the traditional Ring Oscillator based Physical Unclonable Functions (RO-PUF) suffer from two main issues, unreliability of Physical Unclonable Functions (PUF) response and nonrandom distribution of Ring Oscillator (RO) frequencies. In order to improve the PUF reliability, an approximate frequency slope compensation method that uses the slope relationship between RO frequency and temperature to compensate the instable RO frequency was proposed in this paper. As a result, the instable Challenge-Response Pairs (CRP) perform the reliable responses. To enhance the security, a new scheme based on Mean Absolute Difference (MAD) was proposed in this paper. Firstly, the scheme measured the RO's average frequency of each chip, then filtered the corresponding RO's average frequency multiple times to extract the true random frequency. Consequently, the output of PUF follows the random distribution. The experimental results show that the proposed scheme can improve RO-PUF's reliability and security effectively.

In order to solve the safety problems of privacy in the processes of authentication and communication of Radio Frequency IDentification (RFID) system, a mutual authenticate and encrypt scheme with low resource consume, high-level security and applicable for most of RFID systems was designed. This scheme combined the improved Elliptic Curve Diffie-Hellman (ECDH) algorithm and Advanced Encryption Standard (AES) algorithm to implement functions of key distribution, certification and communication encryption. It used dynamic key to enhance security. In addition, this scheme reduced the operation scale with original security strength, and saved the overhead of system resources. The measured results show that this scheme can resist replaying attacks, impersonation attacks, man-in-the-middle attacks and Denial of Service (DoS) attacks so as to save system resources. It can be applied in the field of Internet of Things (IOT) which has requirements on security and costs.

Traditional Deterministic Finite Automata (DFA) based regular expression matching can only process one character per cycle, which is the speed bottleneck. A new algorithm named Multi-Character DFA (MC-DFA) was proposed for high throughput matching and precise positioning. It combined the one character transition in traditional DFA together to handle multi-character processing per cycle. A new transition matrix compress algorithm was also proposed to reduce the redundancy introduced by MC-DFA. The result demonstrates that MC-DFA can improve the throughput efficiently while requiring acceptable memory. For a set of 300 regexes, 8C-DFA obtains a throughput of 7.88Gb/s, memory usage less than 6MB and 19.24s preprocessing time, better than traditional methods.

To improve the rendering realistic effect of the three-dimensional terrain in virtual scene, a new three-dimensional terrain modeling approach was put forward, which was based on reginal distance weighting method. In this method, the sample data was classified by the elevation value and the mapping relationship between classified data and the number of interpolation points constructed. Then, distance weighted factor was obtained by combining the Diamond-square subdivision method to compute the interpolation point coordinate data. At last, to ensure the smoothness and continuity of interpolation points, distance weighting calculation equations was established with the judgment of the interpolation point regional features. Compared with the traditional terrain modeling method, theoretical analysis and simulation results show that this method can improve the realistic effect of the 3D terrain and reduce the terrain rendering time by 20 percent.

Because the base stations can only be placed at the border of the monitored area, the border placement problem was formally defined. For the goal to place the minimum number of base stations to cover as much as possible the monitored areas, an improved placement algorithm with polynomial time was proposed. The coverage percentage of initial algorithm was analyzed first. When initial coverage percentage is larger than guaranteed coverage percentage, it is possible to reduce the size of initial placement set. Finally, placement set was gradually improved to achieve the minimun of placement set. The results indicate that the coverage percentage and placement set of the proposed algorithm are superior to random algorithm in different test environments.

Coverage problem is one of the most fundamental problems in wireless sensor networks since it reflects the sensing quality. The present studys mostly concentrates in Omni-directional sensors which is not suitable in many applications such as video surveillance systems consisting of directional video sensors. This paper present a new (k,ω)-angle coverage problem which study directional sensors deployment. The goal is to deploy minimal number of sensors to k-angle cover all the targets. It present a greedy algorithm to solve this problem. For this algorithm, it define three contribution functions to determine the location to deploy sensor. The proposed method greedily selects a maximal contribution location to deploy a sensor until the entire targets are k-angle covered. Simulation results exhibit the characteristic and performance of this algorithm.

VCR operations are important functions of streaming media servers. Most of conventional caching algorithms implemented by media servers do not consider the impact of VCR operations. Based on the SRB algorithm and combining patching technology, a kind of shared cache algorithm named SRC-SV was proposed, which supported VCR operations. The simulation results show that the SRC-SV algorithm can be used to handle VCR operations and be effective in reducing consumption of server's load and backbone bandwidth.

To extract good background image from complex traffic scenes, a comprehensive dynamic background updating method was proposed. It used the information of both frame-difference and high-level object state to update the mixed Gaussian background model. It could avoid the effect of the prolonged traffic standstill on the background and eliminate the ghosts caused by the move-away of background objects. The results of experiment on the real-time traffic video show that the method is self-adaptive and robust.

Traditional image texture mapping can increase abundant details for virtual object.As virtual lighting condition varies,textures lack realistic representation with dynamic lighting changes.Bump mapping can get basic shadow varying by disturbing normal vectors.But it is difficult for a realistic photo to create a Bump map.Some concepts and theories of BRDF & BTF were described.An image-based method was offered,which could dynamically represent surface detail of diffuse objects.Using it,the mapped textures can represent dynamical effect in different virtual lighting.